Combination of convex theories: Modularity, deduction completeness, and explanation
نویسندگان
چکیده
منابع مشابه
Combination of convex theories: Modularity, deduction completeness, and explanation
Decision procedures are key components of theorem provers and constraint satisfaction systems. Their modular combination is of prime interest for building efficient systems, but their effective use is often limited by poor interface capabilities, when such procedures only provide a simple “sat/unsat” answer. In this paper, we develop a rule-based framework to design cooperation schemas between ...
متن کاملModularity of Completeness Revisited
One of the key results in the eld of modularity for Term Rewriting Systems is the modularity of completeness for left linear TRSs established by Toyama Klop and Barendregt in TKB The proof however is quite long and involved In this paper a new proof of this basic result is given which is both short and easy employing the powerful technique of pile and delete already used with success in proving...
متن کاملOn modularity of theories
We call these subtheories modules. Examples of such theories can be found in reasoning about actions, where each T αi contains descriptions of the atomic action αi in terms of preconditions and effects, and T ∅ is the set of static laws (alias domain constraints, alias integrity constraints), i.e. those formulas that hold in every possible state of a dynamic system. For example, T marry = {¬mar...
متن کاملCompleteness of Category-Based Equational Deduction
Equational deduction is generalised within a category-based abstract model theory framework, and proved complete under a hypothesis of quantiier projectivity, using a semantic treatment that regards quantiiers as models rather than variables, and regards valuations as model morphisms rather than functions. Applications include many and order sorted conditional] equational logics, Horn clause lo...
متن کاملOn Modularity - NP-Completeness and Beyond
Modularity is a recently introduced quality measure for graph clusterings. It has immediately received considerable attention in several disciplines, and in particular in the complex systems literature, although its properties are not well understood. We here present first results on the computational and analytical properties of modularity. The complexity status of modularity maximization is r...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Symbolic Computation
سال: 2010
ISSN: 0747-7171
DOI: 10.1016/j.jsc.2008.10.006